Analysis of multirobot localization uncertainty propagation
نویسندگان
چکیده
This paper deals with the problem of cooperative localization for the case of large groups of mobile robots. A Kalman filter estimator is implemented and tested for this purpose. The focus of this paper is to examine the effect on localization accuracy of the number N of participating robots and the accuracy of the sensors employed. More specifically, we investigate the improvement in localization accuracy per additional robot as the size of the team increases. Furthermore, we provide an analytical expression for the upper bound on the positioning uncertainty increase rate for a team of N robots as a function of N , the odometric and orientation uncertainty for each robot, and the accuracy of a robot tracker measuring relative positions between pairs of robots. The analytical results derived in this paper are validated in simulation for different test cases.
منابع مشابه
Analytical Expressions for Positioning Uncertainty Propagation in Networks of Robots
In this paper we present an analysis of the positioning uncertainty increase rate for a group of mobile robots. The simplified version for a group of N robots moving along one dimension is considered. The one dimension restriction permits us to extract an exact expression for the accumulation of positioning uncertainty in a group of robots equipped with proprioceptive (odometric in this case) a...
متن کاملPropagation of Uncertainty in Cooperative Multirobot Localization: Analysis and Experimental Results
This paper examines the problem of cooperative localization for the case of large groups of mobile robots. A Kalman filter estimator is implemented and tested for this purpose. The focus of this paper is to examine the effect on localization accuracy of the number N of participating robots and the accuracy of the sensors employed. More specifically, we investigate the improvement in localizatio...
متن کاملMultirobot Symbolic Planning under Temporal Uncertainty
Multirobot symbolic planning (MSP) aims at computing plans, each in the form of a sequence of actions, for a team of robots to achieve their individual goals while minimizing overall cost. Solving MSP problems requires modeling limited domain resources (e.g., corridors that allow at most one robot at a time) and the possibility of action synergy (e.g., multiple robots going through a door after...
متن کاملGeneralized Aggregate Uncertainty Measure 2 for Uncertainty Evaluation of a Dezert-Smarandache Theory based Localization Problem
In this paper, Generalized Aggregated Uncertainty measure 2 (GAU2), as a newuncertainty measure, is considered to evaluate uncertainty in a localization problem in which cameras’images are used. The theory that is applied to a hierarchical structure for a decision making to combinecameras’ images is Dezert-Smarandache theory. To evaluate decisions, an analysis of uncertainty isexecuted at every...
متن کاملAn Uncertainty Propagation Architecture for the Localization Problem
In this article, a dynamic localization method based on multi target tracking is presented. The originality of this method is its capability to manage and propagate uncertainties during the localization process. This multi-level uncertainty propagation stage is based on the use of the Dempster-Shafer theory. The perception system we use is composed of an omnidirectional vision system and a pano...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003